Compiler Design


Q41.

Which data structure in a compiler is used for managing information about variables and their attributes?
GateOverflow

Q42.

The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i);
GateOverflow

Q43.

The number of tokens in the FORTRAN statement DO 10 I = 1.25 is
GateOverflow

Q44.

In a compiler the module that checks every character of the source text is called:
GateOverflow

Q45.

In a compiler the module that checks every character of the source text is called:
GateOverflow

Q46.

A simple two-pass assembler does the following in the first pass:
GateOverflow

Q47.

The pass numbers for each of the following activities i. object code generation ii. literals added to literal table iii. listing printed iv. address resolution of local symbols that occur in a two pass assembler respectively are
GateOverflow

Q48.

Consider the following C code segment. for (i = 0, < i n; i++) { for (j=0; j< n; j++) { if (i%2) { x += (4*j + 5*i); y += (7 + 4*j); } } } Which one to the following false?
GateOverflow

Q49.

Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e are initially stored in memory. The binary operators used in this expression tree can be evaluated by the machine only when the operands are in registers. The instructions produce result only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?
GateOverflow

Q50.

Match the following:
GateOverflow